Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks
نویسندگان
چکیده
One approach to integrating first-order logic programming and neural network systems employs the approximation of semantic operators by feedforward networks. For this purpose, it is necessary to view these semantic operators as continuous functions on the reals. This can be accomplished by endowing the space of all interpretations of a logic program with topologies obtained from suitable embeddings. We will present such topologies which arise naturally out of the theory of logic programming, discuss continuity issues of several well-known semantic operators, and derive some results concerning the approximation of these operators by feedforward neural networks.
منابع مشابه
On the Integration of Connectionist and Logic-Based Systems
It is a long-standing and important problem to integrate logic-based systems and connectionist systems. In brief, this problem is concerned with how each of these two paradigms interacts with the other and how each complements the other: how one may give a logical interpretation of neural networks, how one may interpret connectionism within a logical framework, and how one may combine the advan...
متن کاملComputation of Normal Logic Programs by Fibring Neural Networks
In this paper, we develop a theory of the integration of fibring neural networks (a generalization of conventional neural networks) into model-theoretic semantics for logic programming. We present some ideas and results about the approximate computation by fibring neural networks of semantic immediate consequence operators TP and TP , where TP denotes a generalization of TP relative to a many-v...
متن کاملLogic programs and connectionist networks
One facet of the question of integration of Logic and Connectionist Systems, and how these can complement each other, concerns the points of contact, in terms of semantics, between neural networks and logic programs. In this paper, we show that certain semantic operators for propositional logic programs can be computed by feedforward connectionist networks, and that the same semantic operators ...
متن کاملSome Aspects of the Integration of Connectionist and Logic-Based Systems∗†
We discuss the computation by neural networks of semantic operators TP determined by propositional logic programs P over quite general many-valued logics T . We revisit and clarify the foundations of the relevant notions employed in approximating both TP and its fixed points when P is a first-order logic program.
متن کاملProperties of General Semantic Operators Determined by Logic-Based Systems
We discuss a very general semantic operator arising within logic-based programming systems from an algebraic point of view, and show how it connects four interesting aspects of computation: neural networks, conventional logic programming, constraint logic programming, and simple models of uncertainty in logic-based systems.
متن کامل